Building a completely positive factorization
نویسندگان
چکیده
منابع مشابه
Building a completely positive factorization
Using a bordering approach, and building upon an already known factorization of a principal block, we establish sufficient conditions under which we can extend this factorization to the full matrix. Simulations show that the approach is promising also in higher dimensions.
متن کاملBuilding a Completely Reversible Computer
A critical analysis of the feasibility of reversible computing is performed. The key question is: Is it possible to build a completely reversible computer? A closer look into the internal aspects of the reversible computing as well as the external constraints such as the second law of thermodynamics has demonstrated that several difficulties would have to be solved before reversible computer is...
متن کاملNonnegative Tensor Factorization, Completely Positive Tensors, and a Hierarchical Elimination Algorithm
Nonnegative tensor factorization has applications in statistics, computer vision, exploratory multiway data analysis and blind source separation. A symmetric nonnegative tensor, which has an exact symmetric nonnegative factorization, is called a completely positive tensor. This concept extends the concept of completely positive matrices. A classical result in the theory of completely positive m...
متن کاملCompletely positive quantum dissipation
A completely positive master equation describing quantum dissipation for a Brownian particle is derived starting from microphysical collisions, exploiting a recently introduced approach to subdynamics of a macrosystem. The obtained equation can be cast into Lindblad form with a single generator for each Cartesian direction. Temperature dependent friction and diffusion coefficients for both posi...
متن کاملCompletely Positive Semidefinite Rank
An n×n matrix X is called completely positive semidefinite (cpsd) if there exist d×d Hermitian positive semidefinite matrices {Pi}i=1 (for some d ≥ 1) such that Xij = Tr(PiPj), for all i, j ∈ {1, . . . , n}. The cpsd-rank of a cpsd matrix is the smallest d ≥ 1 for which such a representation is possible. In this work we initiate the study of the cpsd-rank which we motivate twofold. First, the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Central European Journal of Operations Research
سال: 2017
ISSN: 1435-246X,1613-9178
DOI: 10.1007/s10100-017-0499-2